Asymptotic behavior of solutions to space‐time fractional diffusion‐reaction equations

This article discusses the analyticity and the long‐time asymptotic behavior of solutions to space‐time fractional diffusion‐reaction equations in . By a Laplace transform argument, we prove that the decay rate of the solution as t→∞ is dominated by the order of the time‐fractional derivative. We consider the decay rate also in a bounded domain. Copyright © 2016 John Wiley & Sons, Ltd.     

Distributed subgradient method for multi‐agent optimization with quantized communication

This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l₁‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

Quantitative asymptotic regularity results for the composition of two mappings

In this paper, we use techniques which originate from proof mining to give rates of asymptotic regularity and metastability for a sequence associated to the composition of two firmly nonexpansive mappings.     

The transport dynamics in complex systems governing by anomalous diffusion modelled with Riesz fractional partial differential equations

In this paper, numerical solutions of fractional Fokker–Planck equations with Riesz space fractional derivatives have been developed. Here, the fractional Fokker–Planck equations have been considered in a finite domain. In order to deal with the Riesz fractional derivative operator, shifted Grünwald approximation and fractional centred difference approaches have been used. The explicit finite difference method and Crank–Nicolson implicit method have been applied to obtain the numerical solutions of fractional diffusion equation and fractional Fokker–Planck equations, respectively. Numerical results are presented to demonstrate the accuracy and effectiveness of the proposed numerical solution techniques. Copyright © 2016 John Wiley & Sons, Ltd.     

Intrinsic decay rate estimates for abstract wave equation with memory

In this paper, we consider an abstract wave equation in the presence of memory. The viscoelastic kernel g(t) is subject to a general assumption , where the function H(·)∈C¹(R⁺) is positive, increasing and convex with H(0)=0. We give the decay result as a solution to a given nonlinear dissipative ODE governed by the function H(s). Copyright © 2017 John Wiley & Sons, Ltd.     

Bounds for Shannon and Zipf‐Mandelbrot entropies

Shannon and Zipf‐Mandelbrot entropies have many applications in many applied sciences, for example, in information theory, biology and economics, etc. In this paper, we consider two refinements of the well‐know Jensen inequality and obtain different bounds for Shannon and Zipf‐Mandelbrot entropies. First of all, we use some convex functions and manipulate the weights and domain of the functions and deduce results for Shannon entropy. We also discuss their particular cases. By using Zipf‐Mandelbrot laws for different parameters in Shannon entropies results, we obtain bounds for Zipf‐Mandelbrot entropy. The idea used in this paper for obtaining the results may stimulate further research in this area, particularly for Zipf‐Mandelbrot entropy.     

Ehrhart Polynomials of 3-Dimensional Simple Integral Convex Polytopes

The author gives an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.     

A half-space projection method for solving generalized Nash equilibrium problems

The generalized Nash equilibrium problem (GNEP) is an n-person noncooperative game in which each player’s strategy set depends on the rivals’ strategy set. In this paper, we presented a half-space projection method for solving the quasi-variational inequality problem which is a formulation of the GNEP. The difference from the known projection methods is due to the next iterate point in this method is obtained by directly projecting a point onto a half-space. Thus, our next iterate point can be represented explicitly. The global convergence is proved under the minimal assumptions. Compared with the known methods, this method can reduce one projection of a vector onto the strategy set per iteration. Numerical results show that this method not only outperforms the known method but is also less dependent on the initial value than the known method.     

Proximal-gradient algorithms for fractional programming

In this paper, we propose two proximal-gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of the underlying fractional programming problem. In case of a convex denominator the numerical scheme approaches the set of critical points of the objective function, provided the latter satisfies the Kurdyka-?ojasiewicz property.